Simulating physical phenomena by quantum networks

Simulating Quantum Computation by Contracting Tensor Networks

The treewidth of a graph is a useful combinatorial measure of how close the graph is to a tree. We prove that a quantum circuit with T gates whose underlying graph has treewidth d can be simulated deterministically in T O(1) exp[O(d)] time, which, in particular, is polynomial in T if d = O(logT ). Among many implications, we show efficient simulations and for log-depth circuits whose gates appl...

Optimally Representing Euclidean Space Discretely for Analogically Simulating Physical Phenomena

Quantum Recurrent Networks for Simulating Stochastic Processes

We introduce the concept of quantum recurrent networks by incorporating classical feedback loops into conventional quantum networks. We show that the dynamical evolution of such networks, which interleave quantum evolution with measurement and reset operations, exhibit novel dynamical properties finding application in pattern recognition, optimization and simulation. Moreover, decoherence in qu...

Usefulness of Simulating Social Phenomena

This paper discussesthe current usefulness and implications of developing research on agent-based Simulation Models of Social Phenomena (SMSP) beyond purely academic, hobbyist or educational purposes. Design, development and testing phases are discussed along with issues evidence-driven modellers often face whilst collecting, analysing and translating quantitative and qualitative empirical data...

Event-by-Event Simulation of Quantum Phenomena

Recent advances in nanotechnology are paving the way to attain control over individual microscopic objects. The ability to prepare, manipulate, couple and measure single microscopic systems facilitate the study of single quantum systems at the level of individual events. Such experiments address the most fundamental aspects of quantum theory. Indeed, quantum theory gives us only a recipe to com...